Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/TRCSRSLASHExConc_Zan97

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> g

The set Q consists of the following terms:

f₁(x0)

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(X) -> g

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(X) -> g

The set Q consists of the following terms:

f₁(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.